Quantum pattern matching oracle construction
نویسندگان
چکیده
We propose a couple of oracle construction methods for quantum pattern matching. in turn show that one the construct can be used with Grover's search algorithm exact and partial matching, deterministically. The other also points to matched indices, but primarily provides means generate Hamming distance between searched all possible sub strings input string, probabilistic way.
منابع مشابه
Quantum Pattern Matching
We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover’s search algorithm as well as to other quantum pattern matching methods [1], which rely on building spe...
متن کاملQuantum Pattern Matching
Finding a match (or nearest match) of an M item pattern against an N item text is a common computing task, useful in string matching and image matching. The best classical (i.e., non-quantum) string matching algorithms, which are Θ(N+M) time and query complexity, are improved in many cases in this paper using Grover’s quantum searching algorithm. Specifically, given quantum oracles that return ...
متن کاملFactor Oracle: A New Structure for Pattern Matching
We introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m +1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results....
متن کاملA Quantum Algorithm for Closest Pattern Matching
We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover’s search algorithm as well as to other quantum pattern matching methods [7], which rely on building spe...
متن کاملOracle Quantum Computing
Building on work of Deutsch and Jozsa, we construct oracles relative to which (1) there is a decision problem that can be solved with certainty in worst-case polynomial time on the quantum computer, yet it cannot be solved classically in probabilis-tic expected polynomial time if errors are not tolerated nor even in nondeterministic polynomial time, and (2) there is a decision problem that can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pramana
سال: 2021
ISSN: ['0304-4289', '0973-7111']
DOI: https://doi.org/10.1007/s12043-020-02062-0